A preconditioned nested splitting conjugate gradient iterative method for the large sparse generalized Sylvester equation
نویسندگان
چکیده
منابع مشابه
Global conjugate gradient method for solving large general Sylvester matrix equation
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...
متن کاملNested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning
We present a nested splitting conjugate gradient iteration method for solving large sparse continuous Sylvester equation, in which both coefficient matrices are (non-Hermitian) positive semi-definite, and at least one of them is positive definite. This method is actually inner/outer iterations, which employs the Sylvester conjugate gradient method as inner iteration to approximate each outer it...
متن کاملglobal conjugate gradient method for solving large general sylvester matrix equation
in this paper, an iterative method is proposed for solving large general sylvester matrix equation $axb+cxd = e$, where $a in r^{ntimes n}$ , $c in r^{ntimes n}$ , $b in r^{stimes s}$ and $d in r^{stimes s}$ are given matrices and $x in r^{stimes s}$ is the unknown matrix. we present a global conjugate gradient (gl-cg) algo- rithm for solving linear system of equations with multiple right-han...
متن کاملPreconditioned Conjugate Gradient Method for the Sparse Generalized Eigenvalue Problem in Electronic Structure Calculations
The use of localized basis sets is essential in linear-scaling electronic structure calculations, and since such basis sets are mostly non-orthogonal, it is necessary to solve the generalized eigenvalue problem Hx = "Sx. In this work, an iterative method for nd-ing the lowest few eigenvalues and corresponding eigenvectors for the generalized eigenvalue problem based on the conjugate gradient me...
متن کاملA Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2014
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2014.09.009